Image Restoration Based on Quadtree Data Structures
نویسنده
چکیده
This paper investigates the problem of image restoration when the image is corrupted by Pepper-and-salt noise and proposes a new restoration algorithm based on quadtree data structures. The crucial parts of the algorithm are picking noise and fuzzy estimation, so that unlike some other usual denoising methods, it avoids blurring and averaging edges and non-noise pixels. This paper describes, analyzes and compares several methods and results of removing noise from image. Experimental results indicate that the new algorithm proposed by this paper is superior.
منابع مشابه
Image Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملHierarchical Spatial Data Structures
An overview is presented of the use of hierarchical spatial data structures such as the quadtree. They are based on the principle of recursive decomposition. The focus is on the representation of data used in image databases. The emphasis is on twodimensional regions, points, rectangles, and lines.
متن کاملVariations on Markovian Quadtree Model for Multiband Astronomical Image Analysis
This paper is concerned with the analysis of multispectral observations, provided by space or ground telescopes. The large amount and the complexity of heterogeneous data to analyse lead us to develop new methods for segmentation tasks, which aim to be robust, fast and efficient. Some prior knowledge on the information to be extracted from the original image is available, and Bayesian statistic...
متن کاملMultiresolution segmentation-based image coding with hierarchical data structures
This paper presents two multiresolution segmentation-based algorithms for low bit rate image compression using hierarchical data structures. The segmentation is achieved with quadtree and BSP-tree hierarchical data structures and the encoding is performed by using the projection pursuit (matching pursuit) with a finite dictionary of spline functions with various degrees of smoothness. Compariso...
متن کاملQuadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in which each node has four descendants. Since most algorithms based on quadtrees require complex navigation between nodes, efficient traversal methods as well as efficient storage techniques are of great interest. In this pa...
متن کامل